Method and apparatus for performing interpolation based on transform and inverse transform

ABSTRACT

Provided are a method and apparatus for interpolating an image. The method includes: selecting a first filter, from among a plurality of different filters, for interpolating between pixel values of integer pixel units, according to an interpolation location; and generating at least one pixel value of at least one fractional pixel unit by interpolating between the pixel values of the integer pixel units by using the selected first filter.

CROSS-REFERENCE TO RELATED PATENT APPLICATIONS

This is a Continuation of U.S. application Ser. No. 14/218,494, filed Mar. 18, 2014, which is a Continuation of U.S. application Ser. No. 13/080,319, filed Apr. 5, 2011 and issued as U.S. Pat. No. 8,676,000 on Mar. 18, 2014, which claims the benefit of U.S. Provisional Application No. 61/320,847, filed on Apr. 5, 2010, and U.S. Provisional Application No. 61/367,498, filed on Jul. 26, 2010, and claims priority from Korean Patent Application No. 10-2010-0095956, filed on Oct. 1, 2010 in the Korean Intellectual Property Office, the disclosures of which are incorporated herein in their entireties by reference.

BACKGROUND

1. Field

Apparatuses and methods consistent with exemplary embodiments relate to interpolating an image, and more particularly, to interpolating between pixel values of integer pixel units.

2. Description of the Related Art

In a related art image encoding and decoding method, one picture is divided into a plurality of macro blocks so as to encode an image. Then, each of the plurality of macro blocks is prediction-encoded by performing inter prediction or intra prediction thereon.

Inter prediction is a method of compressing an image by removing a temporal redundancy between pictures. A representative example of inter prediction is motion-estimation encoding. In motion-estimation encoding, each block of a current picture is predicted by using at least one reference picture. A reference block that is the most similar to a current block is searched for in a predetermined search range by using a predetermined evaluation function.

The current block is predicted based on the reference block, a residual block is obtained by subtracting a predicted block, which is the result of predicting, from the current block, and then the residual block is encoded. In this case, in order to precisely predict the current block, sub pixels that are smaller than integer pixel units are generated by performing interpolation in a search range of the reference picture, and inter prediction is performed based on the sub pixels.

SUMMARY

Aspects of one or more exemplary embodiments provide a method and apparatus for generating pixel values of fractional pixel units by interpolating pixel values of integer pixel units.

Aspects of one or more exemplary embodiments also provide a computer readable recording medium having recorded thereon a computer program for executing the method.

According to an aspect of an exemplary embodiment, there is provided a method of interpolating an image, the method including: selecting a first filter, from among a plurality of different filters, for interpolating between pixel values of integer pixel units, according to an interpolation location; and generating at least one pixel value of at least one fractional pixel unit by interpolating between the pixel values of the integer pixel units by using the selected first filter for interpolating between the pixel values of the integer pixel units.

The method may further include selecting a second filter, from among a plurality of different filters, for interpolating between the generated at least one pixel value of the at least one fractional pixel unit, according to an interpolation location; and interpolating between the generated at least one pixel value of the at least one fractional pixel unit by using the selected second filter for interpolating between the generated at least one pixel value of the at least one fractional pixel unit.

The first filter for interpolating between the pixel values of the integer pixel units may be a spatial-domain filter for transforming the pixel values of the integer pixel units by using a plurality of basis functions having different frequencies, and inverse transforming a plurality of coefficients, which are obtained by the transforming the pixel values of the integer pixel units, by using the plurality of basis functions, phases of which are shifted.

The second filter for interpolating between the generated at least one pixel value of the at least one fractional pixel unit may be a spatial-domain filter for transforming the generated at least one pixel value of the at least one fractional pixel unit by using a plurality of basis functions having different frequencies, and inverse transforming a plurality of coefficients, which are obtained by the transforming the generated at least one pixel value of the at least one fractional pixel unit, by using the plurality of basis functions, phases of which are shifted.

According to an aspect of another exemplary embodiment, there is provided an apparatus for interpolating an image, the apparatus including: a filter selector which selects a first filter, from among a plurality of different filters, for interpolating between pixel values of integer pixel units, according to an interpolation location; and an interpolator which generates at least one pixel value of at least one fractional pixel unit by interpolating between the pixel values of the integer pixel units by using the selected first filter for interpolating between the pixel values of the integer pixel units.

The filter selector may select a second filter, from among a plurality of different filters, for interpolating between the generated at least one pixel value of the at least one fractional pixel unit, according to an interpolation location, and the interpolator may interpolate between the generated at least one pixel value of the at least one fractional pixel unit by using the selected second filter for interpolating between the generated at least one pixel value of the at least one fractional pixel unit.

According to an aspect of another exemplary embodiment, there is provided a computer readable recording medium having embodied thereon a computer program for executing the method described above.

According to an aspect of another exemplary embodiment, there is provided a method of interpolating an image, the method including: transforming pixel values in a spatial domain by using a plurality of basis functions having different frequencies; shifting phases of the plurality of basis functions; and inverse transforming a plurality of coefficients, obtained by the transforming the pixel values, by using the phase-shifted plurality of basis functions.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other features will become more apparent by describing in detail exemplary embodiments with reference to the attached drawings in which:

FIG. 1 is a block diagram of an apparatus for encoding an image according to an exemplary embodiment;

FIG. 2 is a block diagram of an apparatus for decoding an image according to an exemplary embodiment;

FIG. 3 illustrates hierarchical coding units according to an exemplary embodiment;

FIG. 4 is a block diagram of an image encoder based on a coding unit, according to an exemplary embodiment;

FIG. 5 is a block diagram of an image decoder based on a coding unit, according to an exemplary embodiment;

FIG. 6 illustrates a maximum coding unit, a sub coding unit, and a prediction unit, according to an exemplary embodiment;

FIG. 7 illustrates a coding unit and a transform unit, according to an exemplary embodiment;

FIGS. 8A to 8D illustrate division shapes of a coding unit, a prediction unit, and a transform unit, according to an exemplary embodiment;

FIG. 9 is a block diagram of an image interpolation apparatus according to an exemplary embodiment;

FIG. 10 is a diagram illustrating a two-dimensional (2D) interpolation method performed by the image interpolation apparatus of FIG. 9, according to an exemplary embodiment;

FIG. 11 is a diagram illustrating an interpolation region according to an exemplary embodiment;

FIG. 12 is a diagram illustrating a one-dimensional (1D) interpolation method according to an exemplary embodiment;

FIG. 13 is a diagram specifically illustrating a 1D interpolation method performed by the image interpolation apparatus of FIG. 9, according to an exemplary embodiment;

FIG. 14 is a block diagram of an image interpolation apparatus according to an exemplary embodiment;

FIG. 15 illustrates 2D interpolation filters according to an exemplary embodiment;

FIGS. 16A to 16F illustrate 1D interpolation filters according to exemplary embodiments;

FIGS. 17A to 17Y illustrate optimized 1D interpolation filters according to exemplary embodiments;

FIGS. 18A and 18B illustrate methods of interpolating pixel values in various directions by using a 1D interpolation filter, according to exemplary embodiments;

FIG. 19A illustrates a 2D interpolation method according to an exemplary embodiment;

FIG. 19B illustrates a 2D interpolation method using a 1D interpolation filter, according to another exemplary embodiment;

FIG. 19C illustrates a 2D interpolation method using a 1D interpolation filter, according to another exemplary embodiment;

FIG. 20 is a flowchart illustrating an image interpolation method according to an exemplary embodiment;

FIG. 21 is a flowchart illustrating an image interpolation method according to another exemplary embodiment;

FIG. 22 is a flowchart illustrating an image interpolation method according to another exemplary embodiment; and

FIGS. 23A to 23E illustrate methods of performing scaling and rounding off in relation to a 1D interpolation filter, according to exemplary embodiments.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Hereinafter, one or more exemplary embodiments will be described more fully with reference to the accompanying drawings. Expressions such as “at least one of,” when preceding a list of elements, modify the entire list of elements but do not modify the individual elements of the list. In the present specification, an “image” may denote a still image for a video or a moving image, that is, the video itself.

FIG. 1 is a block diagram of an apparatus 100 for encoding an image, according to an exemplary embodiment. Referring to FIG. 1, the apparatus 100 for encoding an image includes a maximum coding unit divider 110, an encoding depth determiner 120, an image data encoder 130, and an encoding information encoder 140.

The maximum coding unit divider 110 may divide a current frame or slice based on a maximum coding unit that is a coding unit of the largest size. That is, the maximum coding unit divider 110 may divide the current frame or slice into at least one maximum coding unit.

According to an exemplary embodiment, a coding unit may be represented using a maximum coding unit and a depth. As described above, the maximum coding unit indicates a coding unit having the largest size from among coding units of the current frame, and the depth indicates a degree of hierarchically decreasing the coding unit. As a depth increases, a coding unit may decrease from a maximum coding unit to a minimum coding unit, wherein a depth of the maximum coding unit is defined as a minimum depth and a depth of the minimum coding unit is defined as a maximum depth. Since the size of a coding unit decreases from a maximum coding unit as a depth increases, a sub coding unit of a k^(th) depth may include a plurality of sub coding units of a (k+n)^(th) depth (where k and n are integers equal to or greater than 1.

According to an increase of the size of a frame to be encoded, encoding an image in a greater coding unit may cause a higher image compression ratio. However, if a greater coding unit is fixed, an image may not be efficiently encoded by reflecting continuously changing image characteristics.

For example, when a smooth area such as the sea or sky is encoded, the greater a coding unit is, the more a compression ration may increase. However, when a complex area such as people or buildings is encoded, the smaller a coding unit is, the more a compression ration may increase.

Accordingly, according to an exemplary embodiment, a different maximum image coding unit and a different maximum depth may be set for each frame or slice. Since a maximum depth denotes the maximum number of times by which a coding unit may decrease, the size of each minimum coding unit included in a maximum image coding unit may be variably set according to a maximum depth. The maximum depth may be determined differently for each frame or slice or for each maximum coding unit.

The encoding depth determiner 120 determines a division shape of the maximum coding unit. The division shape may be determined based on calculation of rate-distortion (RD) costs. The determined division shape of the maximum coding unit is provided to the encoding information encoder 140, and image data according to maximum coding units is provided to the image data encoder 130.

A maximum coding unit may be divided into sub coding units having different sizes according to different depths, and the sub coding units having different sizes, which are included in the maximum coding unit, may be predicted or transformed based on processing units having different sizes. In other words, the apparatus 100 for encoding an image may perform a plurality of processing operations for image encoding based on processing units having various sizes and various shapes. To encode image data, processing operations, such as at least one of prediction, transform, and entropy encoding, are performed, wherein processing units having the same size or different sizes may be used for the processing operations, respectively.

For example, the apparatus 100 for encoding an image may select a processing unit that is different from a coding unit to predict the coding unit.

When the size of a coding unit is 2N×2N (where N is a positive integer), processing units for prediction may be 2N×2N, 2N×N, N×2N, and N×N. In other words, motion prediction may be performed based on a processing unit having a shape whereby at least one of the height and width of a coding unit is equally divided by two. Hereinafter, a processing unit, which is the base of prediction, is defined as a ‘prediction unit’.

A prediction mode may be at least one of an intra mode, an inter mode, and a skip mode, and a specific prediction mode may be performed for only a prediction unit having a specific size or shape. For example, the intra mode may be performed for only prediction units having the sizes of 2N×2N and N×N of which the shape is a square. Further, the skip mode may be performed for only a prediction unit having the size of 2N×2N. If a plurality of prediction units exist in a coding unit, the prediction mode with the least encoding errors may be selected after performing prediction for every prediction unit.

Alternatively, the apparatus 100 for encoding an image may perform transform on image data, based on a processing unit having a different size from a coding unit. For the transform in the coding unit, the transform may be performed based on a processing unit having a size equal to or smaller than that of the coding unit. Hereinafter, a processing unit, which is the base of transform, is defined as a ‘transform unit’. The transform may be discrete cosine transform (DCT) or Karhunen Loeve transform (KLT) or any other fixed point spatial transform.

The encoding depth determiner 120 may determine sub coding units included in a maximum coding unit by using RD optimization based on a Lagrangian multiplier. In other words, the encoding depth determiner 120 may determine which shape a plurality of sub coding units divided from the maximum coding unit have, wherein the plurality of sub coding units have different sizes according to their depths. The image data encoder 130 outputs a bitstream by encoding the maximum coding unit based on the division shapes determined by the encoding depth determiner 120.

The encoding information encoder 140 encodes information about an encoding mode of the maximum coding unit determined by the encoding depth determiner 120. In other words, the encoding information encoder 140 outputs a bitstream by encoding information about a division shape of the maximum coding unit, information about the maximum depth, and information about an encoding mode of a sub coding unit for each depth. The information about the encoding mode of the sub coding unit may include information about a prediction unit of the sub coding unit, information about a prediction mode for each prediction unit, and information about a transform unit of the sub coding unit.

The information about the division shape of the maximum coding unit may be information, e.g., flag information, indicating whether each coding unit is divided. For example, when the maximum coding unit is divided and encoded, information indicating whether the maximum coding unit is divided is encoded. Also, when a sub coding unit divided from the maximum coding unit is divided and encoded, information indicating whether the sub coding unit is divided is encoded.

Since sub coding units having different sizes exist for each maximum coding unit and information about an encoding mode must be determined for each sub coding unit, information about at least one encoding mode may be determined for one maximum coding unit.

The apparatus 100 for encoding an image may generate sub coding units by equally dividing both the height and width of a maximum coding unit by two according to an increase of depth. That is, when the size of a coding unit of a k^(th) depth is 2N×2N, the size of a coding unit of a (k+1)^(th) depth is N×N.

Accordingly, the apparatus 100 for encoding an image may determine an optimal division shape for each maximum coding unit, based on sizes of maximum coding units and a maximum depth in consideration of image characteristics. By variably adjusting the size of a maximum coding unit in consideration of image characteristics and encoding an image through division of a maximum coding unit into sub coding units of different depths, images having various resolutions may be more efficiently encoded.

FIG. 2 is a block diagram of an apparatus 200 for decoding an image according to an exemplary embodiment. Referring to FIG. 2, the apparatus 200 for decoding an image includes an image data acquisition unit 210, an encoding information extractor 220, and an image data decoder 230.

The image data acquisition unit 210 acquires image data according to maximum coding units by parsing a bitstream received by the apparatus 200 for decoding an image, and outputs the image data to the image data decoder 230. The image data acquisition unit 210 may extract information about maximum coding units of a current frame or slice from a header of the current frame or slice. In other words, the image data acquisition unit 210 divides the bitstream according to the maximum coding units so that the image data decoder 230 may decode the image data according to the maximum coding units.

The encoding information extractor 220 extracts information about a maximum coding unit, a maximum depth, a division shape of the maximum coding unit, and an encoding mode of sub coding units from the header of the current frame by parsing the bitstream received by the apparatus 200 for decoding an image. The information about the division shape and the information about the encoding mode are provided to the image data decoder 230.

The information about the division shape of the maximum coding unit may include information about sub coding units having different sizes according to depths and included in the maximum coding unit, and may be information (e.g., flag information) indicating whether each coding unit is divided. The information about the encoding mode may include information about a prediction unit according to sub coding units, information about a prediction mode, and information about a transform unit.

The image data decoder 230 restores the current frame by decoding image data of each maximum coding unit, based on the information extracted by the encoding information extractor 220.

The image data decoder 230 may decode the sub coding units included in a maximum coding unit, based on the information about the division shape of the maximum coding unit. The decoding may include intra prediction, inter prediction that includes motion compensation, and inverse transform.

The image data decoder 230 may perform intra prediction or inter prediction based on information about a prediction unit and information about a prediction mode in order to predict a prediction unit. The image data decoder 230 may also perform inverse transform for each sub coding unit based on information about a transform unit of a sub coding unit.

FIG. 3 illustrates hierarchical coding units according to an exemplary embodiment. Referring to FIG. 3, the hierarchical coding units may include coding units whose widths and heights are 64×64, 32×32, 16×16, 8×8, and 4×4. Besides these coding units having perfect square shapes, coding units whose width and heights are 64×32, 32×64, 32×16, 16×32, 16×8, 8×16, 8×4, and 4×8 may also exist.

Referring to FIG. 3, for image data 310 whose resolution is 1920×1080, the size of a maximum coding unit is set to 64×64, and a maximum depth is set to 2.

For image data 320 whose resolution is 1920×1080, the size of a maximum coding unit is set to 64×64, and a maximum depth is set to 3. For image data 330 whose resolution is 352×288, the size of a maximum coding unit is set to 16×16, and a maximum depth is set to 1.

When the resolution is high or the amount of data is great, a maximum size of a coding unit may be relatively great to increase a compression ratio and exactly reflect image characteristics. Accordingly, for the image data 310 and 320 having higher resolution than the image data 330, 64×64 may be selected as the size of a maximum coding unit.

A maximum depth indicates the total number of layers in the hierarchical coding units. Since the maximum depth of the image data 310 is 2, a coding unit 315 of the image data 310 may include a maximum coding unit whose longer axis size is 64 and sub coding units whose longer axis sizes are 32 and 16, according to an increase of a depth.

On the other hand, since the maximum depth of the image data 330 is 1, a coding unit 335 of the image data 330 may include a maximum coding unit whose longer axis size is 16 and coding units whose longer axis sizes are 8 and 4, according to an increase of a depth.

However, since the maximum depth of the image data 320 is 3, a coding unit 325 of the image data 320 may include a maximum coding unit whose longer axis size is 64 and sub coding units whose longer axis sizes are 32, 16, 8 and 4 according to an increase of a depth. Since an image is encoded based on a smaller sub coding unit as a depth increases, the current exemplary embodiment is suitable for encoding an image including more minute scenes.

FIG. 4 is a block diagram of an image encoder 400 based on a coding unit, according to an exemplary embodiment. An intra prediction unit 410 performs intra prediction on prediction units of the intra mode in a current frame 405, and a motion estimator 420 and a motion compensator 425 perform inter prediction and motion compensation on prediction units of the inter mode by using the current frame 405 and a reference frame 495.

Residual values are generated based on the prediction units output from the intra prediction unit 410, the motion estimator 420, and the motion compensator 425, and are then output as quantized transform coefficients by passing through a transformer 430 and a quantizer 440.

The quantized transform coefficients are restored to the residual values by passing through an inverse quantizer 460 and an inverse transformer 470, are post-processed by passing through a deblocking unit 480 and a loop filtering unit 490, and are then output as the reference frame 495. The quantized transform coefficients may be output as a bitstream 455 by passing through an entropy encoder 450.

To perform encoding based on an encoding method according to an exemplary embodiment, components of the image encoder 400, i.e., the intra prediction unit 410, the motion estimator 420, the motion compensator 425, the transformer 430, the quantizer 440, the entropy encoder 450, the inverse quantizer 460, the inverse transformer 470, the deblocking unit 480, and the loop filtering unit 490, may perform image encoding processes, based on a maximum coding unit, sub coding units according to depths, a prediction unit, and a transform unit.

FIG. 5 is a block diagram of an image decoder 500 based on a coding unit, according to an exemplary embodiment. Referring to FIG. 5, a bitstream 505 is parsed by a parser 510 in order to obtain encoded image data to be decoded and encoding information which is necessary for decoding. The encoded image data is output as inverse-quantized data by passing through an entropy decoder 520 and an inverse quantizer 530, and is restored to residual values by passing through an inverse transformer 540. The residual values are restored according to coding units by being added to an intra prediction result of an intra prediction unit 550 or a motion compensation result of a motion compensator 560. The restored coding units are used for prediction of next coding units or a next frame by passing through a deblocking unit 570 and a loop filtering unit 580.

To perform decoding based on a decoding method according to an exemplary embodiment, components of the image decoder 500, i.e., the parser 510, the entropy decoder 520, the inverse quantizer 530, the inverse transformer 540, the intra prediction unit 550, the motion compensator 560, the deblocking unit 570, and the loop filtering unit 580, may perform image decoding processes based on a maximum coding unit, sub coding units according to depths, a prediction unit, and a transform unit.

In particular, the intra prediction unit 550 and the motion compensator 560 determine a prediction unit and a prediction mode in a sub coding unit by considering a maximum coding unit and a depth, and the inverse transformer 540 performs inverse transform by considering the size of a transform unit.

FIG. 6 illustrates a maximum coding unit, a sub coding unit, and a prediction unit, according to an exemplary embodiment. The apparatus 100 for encoding an image illustrated in FIG. 1 and the apparatus 200 for decoding an image illustrated in FIG. 2 use hierarchical coding units to perform encoding and decoding in consideration of image characteristics. A maximum coding unit and a maximum depth may be adaptively set according to the image characteristics or variously set according to requirements of a user.

In FIG. 6, a hierarchical coding unit structure 600 has a maximum coding unit 610 whose height and width are 64 and maximum depth is 4. A depth increases along a vertical axis of the hierarchical coding unit structure 600, and as a depth increases, the heights and widths of sub coding units 620 to 650 decrease. Prediction units of the maximum coding unit 610 and the sub coding units 620 to 650 are shown along a horizontal axis of the hierarchical coding unit structure 600.

The maximum coding unit 610 has a depth of 0 and the size of a coding unit, i.e., height and width, of 64×64. A depth increases along the vertical axis, and there exist a sub coding unit 620 whose size is 32×32 and depth is 1, a sub coding unit 630 whose size is 16×16 and depth is 2, a sub coding unit 640 whose size is 8×8 and depth is 3, and a sub coding unit 650 whose size is 4×4 and depth is 4. The sub coding unit 650 whose size is 4×4 and depth is 4 is a minimum coding unit, and the minimum coding unit may be divided into prediction units, each of which is less than the minimum coding unit.

Referring to FIG. 6, examples of a prediction unit are shown along the horizontal axis according to each depth. That is, a prediction unit of the maximum coding unit 610 whose depth is 0 may be a prediction unit whose size is equal to the coding unit 610, i.e., 64×64, or a prediction unit 612 whose size is 64×32, a prediction unit 614 whose size is 32×64, or a prediction unit 616 whose size is 32×32, which has a size smaller than the coding unit 610 whose size is 64×64.

A prediction unit of the coding unit 620 whose depth is 1 and size is 32×32 may be a prediction unit whose size is equal to the coding unit 620, i.e., 32×32, or a prediction unit 622 whose size is 32×16, a prediction unit 624 whose size is 16×32, or a prediction unit 626 whose size is 16×16, which has a size smaller than the coding unit 620 whose size is 32×32.

A prediction unit of the coding unit 630 whose depth is 2 and size is 16×16 may be a prediction unit whose size is equal to the coding unit 630, i.e., 16×16, or a prediction unit 632 whose size is 16×8, a prediction unit 634 whose size is 8×16, or a prediction unit 636 whose size is 8×8, which has a size smaller than the coding unit 630 whose size is 16×16.

A prediction unit of the coding unit 640 whose depth is 3 and size is 8×8 may be a prediction unit whose size is equal to the coding unit 640, i.e., 8×8, or a prediction unit 642 whose size is 8×4, a prediction unit 644 whose size is 4×8, or a prediction unit 646 whose size is 4×4, which has a size smaller than the coding unit 640 whose size is 8×8.

Finally, the coding unit 650 whose depth is 4 and size is 4×4 is a minimum coding unit and a coding unit of a maximum depth, and a prediction unit of the coding unit 650 may be a prediction unit 650 whose size is 4×4, a prediction unit 652 having a size of 4×2, a prediction unit 654 having a size of 2×4, or a prediction unit 656 having a size of 2×2.

FIG. 7 illustrates a coding unit and a transform unit, according to an exemplary embodiment. The apparatus 100 for encoding an image illustrated in FIG. 1 and the apparatus 200 for decoding an image illustrated in FIG. 2 perform encoding and decoding with a maximum coding unit itself or with sub coding units, which are equal to or smaller than the maximum coding unit, divided from the maximum coding unit. In the encoding and decoding process, the size of a transform unit for transform may be selected to be no larger than that of a corresponding coding unit. For example, referring to FIG. 7, when a current coding unit 710 has the size of 64×64, transform may be performed using a transform unit 720 having the size of 32×32.

FIGS. 8A through 8D illustrate division shapes of a coding unit, a prediction unit, and a transform unit, according to an exemplary embodiment. Specifically, FIGS. 8A and 8B illustrate a coding unit and a prediction unit according to an exemplary embodiment.

FIG. 8A shows a division shape selected by the apparatus 100 for encoding an image illustrated in FIG. 1, in order to encode a maximum coding unit 810. The apparatus 100 for encoding an image divides the maximum coding unit 810 into various shapes, performs encoding thereon, and selects an optimal division shape by comparing encoding results of the various division shapes with each other based on R-D costs. When it is optimal that the maximum coding unit 810 is encoded as it is, the maximum coding unit 810 may be encoded without dividing the maximum coding unit 810 as illustrated in FIGS. 8A through 8D.

Referring to FIG. 8B, the maximum coding unit 810 whose depth is 0 is encoded by dividing it into sub coding units whose depths are equal to or greater than 1. That is, the maximum coding unit 810 is divided into four sub coding units whose depths are 1, and all or some of the sub coding units whose depths are 1 are divided into sub coding units whose depths are 2.

A sub coding unit located in an upper-right side and a sub coding unit located in a lower-left side among the sub coding units whose depths are 1 are divided into sub coding units whose depths are equal to or greater than 2. Some of the sub coding units whose depths are equal to or greater than 2 may be divided into sub coding units whose depths are equal to or greater than 3.

FIG. 8B shows a division shape of a prediction unit for the maximum coding unit 810. Referring to FIG. 8B, a prediction unit 860 for the maximum coding unit 810 may be divided differently from the maximum coding unit 810. In other words, a prediction unit for each of sub coding units may be smaller than a corresponding sub coding unit.

For example, a prediction unit for a sub coding unit 854 located in a lower-right side among the sub coding units whose depths are 1 may be smaller than the sub coding unit 854. In addition, prediction units for some sub coding units 814, 816, 850, and 852 from among sub coding units 814, 816, 818, 828, 850, and 852 whose depths are 2 may be smaller than the sub coding units 814, 816, 850, and 852, respectively.

In addition, prediction units for sub coding units 822, 832, and 848 whose depths are 3 may be smaller than the sub coding units 822, 832, and 848, respectively. The prediction units may have a shape whereby respective sub coding units are equally divided by two in a direction of height or width or have a shape whereby respective sub coding units are equally divided by four in directions of height and width.

FIGS. 8C and 8D illustrate a prediction unit and a transform unit, according to an exemplary embodiment.

FIG. 8C shows a division shape of a prediction unit for the maximum coding unit 810 shown in FIG. 8B, and FIG. 8D shows a division shape of a transform unit of the maximum coding unit 810.

Referring to FIG. 8D, a division shape of a transform unit 870 may be set differently from the prediction unit 860.

For example, even though a prediction unit for the coding unit 854 whose depth is 1 is selected with a shape whereby the height of the coding unit 854 is equally divided by two, a transform unit may be selected with the same size as the coding unit 854. Likewise, even though prediction units for coding units 814 and 850 whose depths are 2 are selected with a shape whereby the height of each of the coding units 814 and 850 is equally divided by two, a transform unit may be selected with the same size as the original size of each of the coding units 814 and 850.

A transform unit may be selected with a smaller size than a prediction unit. For example, when a prediction unit for the coding unit 852 whose depth is 2 is selected with a shape whereby the width of the coding unit 852 is equally divided by two, a transform unit may be selected with a shape whereby the coding unit 852 is equally divided by four in directions of height and width, which has a smaller size than the shape of the prediction unit.

FIG. 9 is a block diagram of an image interpolation apparatus 900 according to an exemplary embodiment. Image interpolation may be used to convert an image having a low resolution to an image having a high resolution. Also, image interpolation may be used to convert an interlaced image to a progressive image or may be used to up-sample an image having a low resolution to a higher resolution. When the image encoder 400 of FIG. 4 encodes an image, the motion estimator 420 and the motion compensator 425 may perform inter prediction by using an interpolated reference frame. That is, referring to FIG. 4, an image having a high resolution may be generated by interpolating the reference frame 495, and motion estimation and compensation may be performed based on the image having the high resolution, thereby increasing the precision of inter prediction. Likewise, when the image decoder 500 of FIG. 5 decodes an image, the motion compensator 550 may perform motion compensation by using an interpolated reference frame, thereby increasing the precision of inter prediction.

Referring to FIG. 9, the image interpolation apparatus 900 includes a transformer 910 and an inverse transformer 920.

The transformer 910 transforms pixel values by using a plurality of basis functions having different frequencies. The transform may be one of various processes of transforming pixel values in a spatial domain into frequency-domain coefficients, and may be, for example, DCT as described above. Pixel values of an integer pixel unit are transformed using the plurality of basis functions. The pixel values may be pixel values of luminance components or of chroma components. The type of the plurality of basis functions is not limited, and may be one of various types of functions for transforming pixel values in a spatial domain into a frequency-domain value(s). For example, the plurality of basis functions may be cosine functions for performing DCT or inverse DCT. Also, various types of basis functions, such as sine basis functions or polynomial basis functions, may be used. Examples of DCT may include modified DCT, and modified DCT that uses windowing.

The inverse transformer 920 shifts the phases of the plurality of basis functions used for performing transform by the transformer 910, and inverse transforms a plurality of coefficients, i.e., the frequency-domain values, which are generated by the transformer 910, by using the plurality of basis functions, the phases of which are shifted. Transform performed by the transformer 910 and inverse transform performed by the inverse transformer 920 will now be described by using two-dimensional (2D) DCT and one-dimensional (1D) DCT.

<2D DCT and 2D Inverse DCT>

FIG. 10 is a diagram illustrating a 2D interpolation method performed by the image interpolation apparatus 900 of FIG. 9, according to an exemplary embodiment. Referring to FIG. 10, the image interpolation apparatus 900 generates pixel values on locations X, i.e., interpolation locations, by interpolating between pixel values of integer pixel units in the spatial domain, e.g., pixel values on locations O in a block 1000. The pixel values on the locations X are pixel values of fractional pixel units, the interpolation locations of which are determined by ‘α_(x)’ and ‘α_(y)’. Although FIG. 10 illustrates a case where the block 1000 has a size of 4×4, the size of the block 1000 is not limited to 4×4, and it would be obvious to those of ordinary skill in the art that pixel values of fractional pixel units may be generated by performing 2D DCT and 2D inverse DCT on a block that is smaller or larger than the block 1000.

First, the transformer 910 performs 2D DCT on the pixel values of the integer pixel units. 2D DCT may be performed according to the following equation:

C=D(x)×REF×D(y)  (1),

wherein ‘C’ denotes a block that includes frequency-domain coefficients obtained by performing 2D DCT, ‘REF’ denotes the block 1000 on which DCT is performed, ‘D(x)’ is a matrix for performing DCT in the X-axis direction, i.e., the horizontal direction, and ‘D(y)’ denotes a matrix for performing DCT in the Y-axis direction, i.e., the vertical direction. Here, ‘D(x)’ and ‘D(y)’ may be defined by the following equation (2):

$\begin{matrix} {{{D_{kl}(x)} = {\frac{2}{S_{x}}{\cos \left( \frac{\left( {{2l} + 1} \right)k\; \pi}{2S_{x}} \right)}}}{O \leq k \leq {S_{x} - 1}}{{O \leq l \leq {S_{x} - 1}},}} & (2) \end{matrix}$

wherein ‘k’ and ‘1’ denote integers each satisfying the condition expressed in Equation (2), ‘D_(kl)(x)’ denotes a k^(th) row and an l^(th) column of a square matrix D(x), and S_(x) denotes the horizontal and vertical sizes of the square matrix D(x).

$\begin{matrix} {{{D_{kl}(y)} = {\frac{2}{S_{y}}{\cos \left( \frac{\left( {{2l} + 1} \right)k\; \pi}{2S_{y}} \right)}}}{O \leq k \leq {S_{y} - 1}}{{O \leq l \leq {S_{y} - 1}},}} & (3) \end{matrix}$

wherein ‘k’ and ‘1’ denote integers each satisfying the condition expressed in Equation (3), D_(kl)(y) denotes a k^(th) row and an l^(th) column of a square matrix D(y), and S_(y) denotes the horizontal and vertical sizes of the square matrix D(y).

The transformer 910 performs 2D DCT on the block 1000 by calculating Equation (1), and the inverse transformer 910 performs 2D inverse DCT on the frequency-domain coefficients generated by the transformer 910 by calculating the following equation:

P=W(x)×D(x)×REF×D(y)×W(y)  (4),

wherein ‘P’ denotes a block including pixel values on an interpolation location, i.e., the location X, which are obtained by performing inverse DCT. Compared to Equation (1), Equation (4) is obtained by multiplying both sides of the block C by ‘W(x)’ and ‘W(y)’, respectively, so as to perform inverse DCT on the block C. Here, ‘W(x)’ denotes a matrix for performing inverse DCT in the horizontal direction, and ‘W(y)’ denotes performing inverse DCT in the vertical direction.

As described above, the inverse transformer 910 uses the plurality of basis functions, the phases of which are shifted, so as to perform 2D inverse DCT. ‘W(x)’ and ‘W(y)’ may be defined by the following equations (5) and (6):

$\begin{matrix} {{{{W_{l\; 0}(x)} = \frac{1}{2}}{W_{lk}(x)} = {{{\cos \left( \frac{\left( {{2l} + 1 + {2\alpha_{x}}} \right)k\; \pi}{2S_{x}} \right)}.O} \leq k \leq {S_{x} - 1.}}}{{O \leq l \leq {S_{x} - 1}},}} & (5) \end{matrix}$

wherein ‘1’ and ‘k’ denote integers each satisfying the condition expressed in Equation (5), ‘W_(lk)(x)’ denotes an l^(th) row and a k^(th) column of a square matrix W(x), and S_(x) denotes the horizontal and vertical sizes of the square matrix W(x). α_(x) denotes a horizontal interpolation location as illustrated in FIG. 10, and may be a fractional number, e.g., ½, ¼, ¾, ⅛, ⅜, ⅝, ⅞, 1/16, or . . . . However, the fractional number is not limited thereto, and α_(x) may be a real number.

$\begin{matrix} {{{W_{l\; 0}(y)} = \frac{1}{2}}{{{W_{lk}(y)} = {\cos \left( \frac{\left( {{2l} + 1 + {2\alpha_{y}}} \right)k\; \pi}{2S_{y}} \right)}},{O \leq k \leq {S_{y} - 1}},{O \leq l \leq {S_{y} - 1}},}} & (6) \end{matrix}$

wherein ‘l’ and ‘k’ denote integers each satisfying the condition expressed in Equation (6), ‘W_(lk)(y)’ denotes an l^(th) row and an k^(th) column of a square matrix W(y), and S_(y) denotes the horizontal and vertical sizes of the square matrix W(y). α_(y) denotes a vertical interpolation location as illustrated in FIG. 10, and may be a fractional number, e.g., ½, ¼, ¾, ⅛, ⅜, ⅝, ⅞, 1/16, or . . . . However, the fractional number is not limited thereto, and α_(y) may be a real number.

Compared to Equations (2) and (3), the phases of the plurality of basis functions used by the inverse transformer 910, i.e., a plurality of cosine functions, are shifted by 2α_(x) and 2α_(y), respectively, in Equations (5) and (6). If the inverse transformer 910 performs 2D inverse DCT based on the plurality of cosine functions, the phases of which are shifted, as expressed in Equations (5) and (6), then the pixel values of the locations X are generated.

FIG. 11 is a diagram illustrating an interpolation region 1110 according to an exemplary embodiment. When the transformer 910 and the inverse transformer 920 of FIG. 9 generate pixel values on interpolation locations by performing 2D DCT and 2D inverse DCT, respectively, a region 1120 that is larger than a block that is to be interpolated, i.e., an interpolation region 1110, may be used. In general, the precision of interpolation may be lowered at the borders of the interpolation region 1110, and thus, the correlation between pixel values adjacent to an interpolation location may be considered for interpolation. The image interpolation apparatus 900 of FIG. 9 performs 2D DCT on pixel values included in the interpolation region 1110 and then performs 2D inverse DCT on the result of performing the 2D DCT, wherein the correlation between the pixel values included in the interpolation region 1110 and pixel values outside the interpolation region 1110 is not considered.

Thus, the image interpolation apparatus 900 performs interpolation on the region 1120, which is larger than the interpolation region 1110 and includes the interpolation region 1110 and a region adjacent to the interpolation region 1110, and uses the pixel values in the interpolation region 1110 for motion compensation.

<1D DCT and 1D Inverse DCT>

FIG. 12 is a diagram illustrating a 1D interpolation method according to an exemplary embodiment. Referring to FIG. 12, the image interpolation apparatus 900 of FIG. 9 generates a pixel value 1200 on an interpolation location by interpolating between a pixel value 1210 and a pixel value 1220 of integer pixel units in a spatial domain. The pixel value 1200 is a pixel value of a fractional pixel unit, the interpolation location of which is determined by ‘α’. The 1D interpolation method according to the current exemplary embodiment will be described below in detail with reference to FIG. 13.

FIG. 13 is a diagram specifically illustrating a 1D interpolation method performed by the image interpolation apparatus 900 of FIG. 9, according to an exemplary embodiment. Referring to FIG. 13, a plurality of adjacent pixel values 1310 and 1320 that include pixel values 1210 and 1220 of integer pixel units, respectively, are used to generate a pixel value 1200 of a fractional pixel unit by interpolating between the two pixel values 1210 and 1220. In other words, 1D DCT is performed on −(M−1)^(th) to M^(th) pixel values, i.e., 2M pixel values, 1D inverse DCT is performed on the result of performing the 1D DCT, based on a plurality of basis functions, the phases of which are shifted, thereby interpolating between a 0^(th) pixel and a 1^(St) pixel. FIG. 13 illustrates a case where M=6, but ‘M’ is not limited to 6 and may be any positive integer greater than 0.

Also, FIGS. 12 and 13 illustrate cases where interpolation is performed between pixel values adjacent in the horizontal direction, but it would be obvious to those of ordinary skill in the art that the 1D interpolation methods of FIGS. 12 and 13 may be used to interpolate between pixel values adjacent in the vertical direction or a diagonal direction (See FIGS. 18A and 18B for more details).

The transformer 910 performs 1D DCT on pixel values of integer pixel units. The 1D DCT may be performed by calculating the following equation:

$\begin{matrix} {{C_{k} = {\frac{1}{M}{\sum\limits_{l = {{- M} + 1}}^{M}{{p(l)}{\cos \left( \frac{\left( {{2l} - 1 + {2M}} \right)k\; \pi}{4M} \right)}}}}}{{O \leq k \leq {{2M} - 1}},}} & (7) \end{matrix}$

wherein ‘p(1)’ denotes the −(M−1)^(th) to M^(th) pixel values, for example, the −5^(th) to 6^(th) pixel values 1310 and 1320 illustrated in FIG. 13, and ‘C_(k)’ denotes a plurality of coefficients obtained by performing 1D DCT on the pixel values. Here, ‘k’ denotes a positive integer satisfying the condition expressed in Equation (7).

When the transformer 910 performs 1D DCT on the pixel values 1310 and 1320 by calculating Equation (7), the inverse transformer 920 performs 1D inverse DCT on frequency-domain coefficients generated by the transformer 910 by calculating the following Equation (8).

$\begin{matrix} {{{P(\alpha)} = {\frac{C_{0}}{2} + {\sum\limits_{k = 1}^{{2M} - 1}{C_{k}{\cos \left( \frac{\left( {{2\alpha} - 1 + {2M}} \right)k\; \pi}{4M} \right)}}}}},} & (8) \end{matrix}$

wherein ‘α’ denotes an interpolation location between two pixel values as described above with reference to FIG. 13, and may be one of various fractional numbers, e.g., ½, ¼, ¾, ⅛, ⅜, ⅝, ⅞, 1/16, . . . . The fractional numbers are not limited, and ‘α’ may be a real number. ‘P(α)’ denotes the pixel value 1200 on the interpolation location generated by performing 1D inverse DCT. Compared to Equation (7), the phase of the cosine function expressed in Equation (8), which is a basis function used for performing 1D inverse DCT, is determined by the fractional number ‘α’ other than an integer ‘1’, and is thus different from the phase of the basis function used for performing 1D DCT.

FIG. 14 is a block diagram of an image interpolation apparatus 1400 according to an exemplary embodiment. Referring to FIG. 14, the image interpolation apparatus 1400 includes a filter selector 1410 and an interpolator 1420. The image interpolation apparatus 900 of FIG. 9 transforms an image and inversely transforms the result of transforming based on a plurality of basis functions, the phases of which are shifted. However, if transform and inverse transform are performed whenever pixel values are input to the image interpolation apparatus 900, the amount of calculation required is large, thereby decreasing the operating speed of an image processing system.

Thus, image interpolation may be quickly performed in a spatial domain without having to transform the spatial domain to a frequency domain by calculating filter coefficients for performing transform and inverse transform described above and then filtering pixel values in the spatial domain, which are to be input to the image interpolation apparatus 1400, by using the calculated filter coefficients.

The filter selector 1410 receives information regarding an interpolation location and selects a filter to be used for interpolation. As described above, the filter is used to transform pixel values based on a plurality of basis functions having different frequencies and to inversely transform a plurality of coefficients, which are obtained through the transform, based on the plurality of basis functions, the phases of which are shifted. The filter coefficients may vary according to an interpolation location, and the filter is selected according to the interpolation location.

As described above with reference to FIG. 9, the pixel values are transformed using the plurality of basis functions having different frequencies, and the phases of the plurality of basis functions having different frequencies are shifted according to the interpolation location so as to perform inverse transform. Then, the pixel values on the interpolation location may be interpolated by inversely transforming the plurality of coefficients by using the plurality of basis functions, the phases of which are shifted. In other words, if transform is performed based on pixel values of integer pixel units and inverse transform is performed based on the plurality of basis functions, the phases of which are shifted, according to the interpolation location, then pixel values of at least one fractional pixel unit may be generated for various interpolation locations. Thus, the filter selector 1410 of FIG. 14 presets a plurality of filters for performing transform and performing inverse transform based on different basis functions, and selects one of the preset filters, based on information regarding an interpolation location.

The interpolator 1420 performs interpolation by using the filter selected by the filter selector 1410. Specifically, interpolation is performed by filtering a plurality of pixel values of integer pixel units based on the selected filter. As the result of interpolation, a pixel value(s) on a predetermined interpolation location, i.e., a pixel value(s) of a fractional pixel unit, is(are) obtained. Referring to FIG. 10, if a block that includes a plurality of pixel values of integer pixel units is filtered with a 2D filter, then a plurality of pixel values on interpolation locations, each of which is determined by ‘α_(x)’ and ‘α_(y)’, are generated. Referring to FIG. 13, if a row or column including a plurality of pixel values of integer pixel units is filtered with a 1D filter, then a plurality of pixel values on interpolations a are generated. Interpolation methods performed using the 2D filter and the 1D filter, respectively, will now be described below with reference to the accompanying drawings.

<2D filter>

P=W(x)×D(x)×REF×D(y)×W(y)

as described above in relation to Equation (4). This equation may also be expressed as follows:

P=F(x)×REF×F(y)  (9),

wherein ‘F(x)’ denotes a filter for transforming a REF block in the horizontal direction and for inverse transforming the result of transforming in the horizontal direction by using the plurality of basis functions, the phases of which are shifted. ‘F(y)’ denotes a filter for transforming the REF block in the vertical direction and for inverse transforming the result of transforming in the vertical direction by using the plurality of basis functions, the phases of which are shifted. For example, ‘F(x)’ may denote a filter for performing DCT on the REF block in the horizontal direction, and performing inverse DCT on the result of performing in the horizontal direction by using a plurality of cosine functions, the phases of which are shifted. ‘F(y)’ may denote a filter for performing DCT on the REF block in the vertical direction, and performing inverse DCT on the result of performing in the vertical direction by using a plurality of cosine functions, the phases of which are shifted.

According to Equations (2), (3), (5), and (6), the filters F(x) and F(y) may be defined by the following Equations (10) and (11):

$\begin{matrix} {{{F_{kl}(x)} = {\sum\limits_{n = 0}^{S_{x} - 1}{{W_{kn}(x)}{D_{nl}(x)}}}}{{O \leq k \leq {S_{x} - {1O}} \leq l \leq {S_{x} - 1}},}} & (10) \end{matrix}$

wherein ‘k’ and ‘1’ denote integers each satisfying the condition expressed in Equation (10), ‘F_(kl)(x)’ denotes a k^(th) row and a l^(th) column of a matrix F(x), and S_(x) denotes the horizontal and vertical sizes of square matrices W(x) and D(x). Since the square matrices W(x) and D(x) have the same size, the horizontal and vertical sizes thereof are also the same. ‘W_(kn)(x)’ denotes a k^(th) row and a n^(th) column of the square matrix W(x) described above in relation to Equation (5). D_(nl)(x) denotes an n^(th) row and an l^(th) column of the square matrix D(x) described above in relation to Equation (2).

$\begin{matrix} {{{F_{kl}(y)} = {\sum\limits_{n = 0}^{S_{y} - 1}{{D_{kn}(y)}{W_{nl}(y)}}}}{{O \leq k \leq {S_{y} - {1O}} \leq l \leq {S_{y} - 1}},}} & (11) \end{matrix}$

wherein ‘k’ and ‘l’ denote integers each satisfying the condition expressed in Equation (11), ‘F_(kl)(y)’ denotes a k^(th) row and a column of a matrix F(y), and S_(y) denotes the horizontal and vertical sizes of square matrices W(y) and D(y). Since the square matrices W(y) and D(y) have the same size, the horizontal and vertical sizes thereof are also the same. ‘W_(nl)(y)’ denotes an n^(th) row and an l^(th) column of the square matrix W(y) described above in relation to Equation (5). ‘D_(kn)(y)’ denotes a k^(th) row and a n^(th) column of the square matrix D(y) described above in relation to Equation (2).

If interpolation is performed by increasing bit-depths of the filters F(x) and F(y), the precision of filtering may be improved. Thus, according to an exemplary embodiment, coefficients of the filters F(x) and F(y) are increased by multiplying them by a predetermined value, and an image may be interpolated using these filters including the increased coefficients. In this case, Equation (9) may be changed as follows:

P=(F′(x)×REF×F′(y))/S ²  (12),

wherein ‘F’(x)′ denotes a filter scaled by multiplying the coefficients of the filter F(x) by a scaling factor ‘S’ and rounding off the result of multiplication to an integer, and ‘F’(y)′ denotes a filter obtained by multiplying the coefficients of the filter F(y) by ‘S’ and rounding off the result of multiplication to an integer. Since interpolation is performed using the scaled filter, the pixel values on the interpolation locations are calculated and are then divided by ‘S²’ to compensate for the scaling effect.

FIG. 15 illustrates 2D interpolation filters according to an exemplary embodiment. Specifically, FIG. 15 illustrates filter coefficients scaled according to Equation (2). That is, FIG. 15 illustrates 2D interpolation filters F′(x) when ‘α_(x)’ is ¼, ½, and ¾, wherein the 2D interpolation filters F′(x) are generated by multiplying the coefficients of the 2D interpolation filter F(x) by a scaling factor 2¹³. A 2D interpolation filter F′(y) when ‘α_(y)’ is ¼, ½, and ¾, may be used by transposing the filter F′(x).

Referring to FIG. 14, if the filter selector 1410 selects one of the 2D interpolation filters of FIG. 15 based on an interpolation location, the interpolator 1420 generates pixel values on the interpolation location by calculating Equation (9) or (12).

<1D Filter>

1D DCT according to Equation (7) may be expressed as the following determinant:

C=D×REF  (13),

wherein ‘C’ denotes a (2M×1) matrix for 2M coefficients described above in relation to Equation (7), and ‘REF’ denotes a (2M×1) matrix for pixel values of integer pixel units described above in relation to Equation (7), i.e., P_(−(M-1)), . . . through to P_(M). The total number of pixel values used for interpolation, i.e., 2M, denotes the total number of taps of a 1D interpolation filter. ‘D’ denotes a square matrix for 1D DCT, which may be defined as follows:

$\begin{matrix} {{D_{kl} = {\frac{1}{M}{\cos \left( \frac{\left( {{2l} - 1 + {2M}} \right)k\; \pi}{4M} \right)}}}{{O \leq k \leq {{2M} - 1 - \left( {M - 1} \right)} \leq l \leq M},}} & (14) \end{matrix}$

wherein ‘k’ and ‘1’ denote integers each satisfying the condition expressed in Equation (14), ‘D_(kl)’ denotes a k^(th) row and a l^(th) column of a square matrix D for 1D DCT expressed in Equation (13), and ‘M’ has been described above in relation to Equation (13).

1D DCT using a plurality of basis functions, the phases of which are shifted, according to Equation (8) may be expressed as the following determinant:

P(α)=W(α)×C  (15),

wherein ‘P(α)’ is the same as ‘P(α)’ expressed in Equation (8), and ‘W(α)’ denotes a (1×2M) matrix for 1D inverse DCT using a plurality of basis functions, the phases of which are shifted. ‘W(α)’ may be defined as follows:

$\begin{matrix} {{{W_{0}(\alpha)} = \frac{1}{2}}{{W_{k}(\alpha)} = {\cos \left( \frac{\left( {{2\alpha} - 1 + {2M}} \right)k\; \pi}{4M} \right)}}{1 \leq k \leq {{2M} - 1}}} & (16) \end{matrix}$

wherein ‘k’ denotes an integer satisfying the condition expressed in Equation (16), and ‘W_(k)(α)’ denotes a k^(th) column of the W(α) matrix described above in relation to Equation (15). A 1D interpolation filter F(α) for performing 1D DCT and 1D inverse DCT that uses a plurality of basis functions, the phases of which are shifted, based on Equations (13) and (15), may be defined as follows:

$\begin{matrix} {{{P(\alpha)} = {{F(\alpha)} \times {REF}}}{{F_{l}(\alpha)} = {\sum\limits_{k = 0}^{{2M} - 1}{{W_{k}(\alpha)}D_{kl}}}}{{O \leq k \leq {{2M} - 1 - \left( {M - 1} \right)} \leq l \leq M},}} & (17) \end{matrix}$

wherein ‘k’ and ‘l’ denote integers each satisfying the condition expressed in Equation (17), ‘F_(l)(α)’ denotes an l^(th) column of the filter F(α), and ‘W(α)’ and ‘D’ are the same as ‘W(α)’ and ‘D’ expressed in Equation (13).

The precision of filtering may be improved by increasing the bit-depth of the 1D interpolation filter F(α) similar to a 2D interpolation filter. An image may be interpolated by increasing the coefficients of the 1D interpolation filter F(α) by multiplying them with a predetermined value and using the 1D interpolation filter F(α) including the increased coefficients.

For example, interpolation may be performed by multiplying the 1D interpolation filter F(α) by a scaling factor ‘2^(ScalingBits)’. In this case, P(α)=F(α)×REF expressed in Equation (17) may be changed as follows:

$\begin{matrix} {\mspace{79mu} {{{P( \propto )} = {\left( {{\text{?}{{F_{1}^{\prime}( \propto )} \cdot {REF}_{i}}} + 2^{{ScalingBits}\; - 1}} \right){ScalingBits}}}\;,{\text{?}\text{indicates text missing or illegible when filed}}}} & (18) \end{matrix}$

wherein F′_(l)(α) denotes a filter scaled by multiplying the coefficients of the 1D interpolation filter F(α) by the scaling factor ‘2^(ScalingBits’) and rounding off the result of multiplication to an integer, ‘REF_(l)’ denotes a l^(th) column of the REF matrix expressed in Equation (17), and ‘2^(ScalingBits−1)’ denotes a value added to round off a filtered pixel value. A pixel value on an interpolation location α is calculated by multiplying the scaled filter F′_(l)(α) by a matrix for pixel values, the result of calculation is rounded off by adding the value ‘2^(ScalingBits−1)’ thereto, and the resultant value is shifted by an ‘Scaling Bits’ bit so as to compensate for the scaling effect.

Rounding off used in the Equations described above is just an example of a method of quantizing filter coefficients. In order to generalize a method of quantizing filter coefficients for ease of understanding, filter coefficients may be modified and optimized as expressed in the following Equations (19) and (20):

(F _(l)(α)−ε)≦f′ _(l)(α)≦(F _(l)(α)+ε)  (19),

wherein ‘F_(l)(a)’ denotes an l^(th) coefficient of a filter that is not quantized, ‘f′_(l)(α)’ denotes an l^(th) coefficient of the filter that is quantized, and ‘ε’ denote any real number that may be selected according to a degree of quantization and may be, for example, 0.2*F_(l)(α). According to Equation (19), when the l^(th) coefficient F_(l)(α) that is a real number is calculated according to Equation (13) to (17), then the l^(th) coefficient F_(l)(α) is changed to the l^(th) coefficient f′_(l)(α) satisfying Equation (19), thereby quantizing the l^(th) coefficient F_(l)(α).

When filter coefficients are scaled by a predetermined scaling factor, quantization according to Equation (19) may be changed as follows:

(p*F _(l)(α)−p*ε)≦F′ _(l)(α)≦(p*F _(l)(α)+p*ε)  (20),

wherein ‘p’ denotes a scaling factor (which may be ‘2^(ScalingBits)’) and p*F_(l)(α) denotes a scaled filter coefficient. According to Equation (20), ‘p*F₁(α)’ is converted to ‘F′_(l)(α)’.

FIGS. 16A to 16F illustrate 1D interpolation filters according to exemplary embodiments. In FIGS. 16A to 16F, the scaled filters described above in relation to Equation (18) are illustrated according to the number of taps and an interpolation location. Specifically, FIGS. 16A to 16F illustrate a 4-tap filter, a 6-tap filter, an 8-tap filter, a 10-tap filter, a 12-tap filter, and a 14-tap filter, respectively. In FIGS. 16A to 16F, a scaling factor for filter coefficients is set to ‘256’, i.e., a ScalingBits is set to ‘8’.

In FIGS. 16A to 16F, the filter coefficients include coefficients for high-frequency components, whereby the precision of interpolation and prediction may be increased but image compression efficiency may be degraded due to the high-frequency components. However, interpolation is performed to increase image compression efficiency as described above with reference to FIG. 9. To solve this problem, the filter coefficients illustrated in FIGS. 16A to 16F may be adjusted to increase image compression efficiency in this case

For example, an absolute value of each of the filter coefficients may be reduced, and each filter coefficient at the midpoint of each filter may be multiplied by a larger weighted value than weighted values assigned to the other filter coefficients. For example, referring to FIG. 16B, in the 6-tap filter for generating pixel values on a ½ interpolation location, the filter coefficients, {11, −43, 160, 160, −43, 11,} are adjusted in such a manner that absolute values of ‘11’, ‘−43’, and ‘160’ may be reduced and only ‘160’ at the midpoint of the 6-tap filter is multiplied by a weighted value.

FIGS. 17A to 17Y illustrate optimized 1D interpolation filters according to exemplary embodiments. The filters illustrated in FIGS. 16A to 16F may also be adjusted to easily embody the filter by hardware. When Equation (17) or (18) is calculated using a computer, filter coefficients may be optimized to minimize an arithmetical operation, e.g., bit shifting of binary numbers and addition.

In FIGS. 17A and 17B, the amount of calculation needed to perform filtering for interpolation of each filter is indicated in both “adding” and “shift” units. Each of the filters of FIGS. 17A to 17M includes coefficients optimized to minimize the “adding” and “shift” units on a corresponding interpolation location.

FIGS. 17A and 17B illustrate a 6-tap filter and a 12-tap filter optimized to interpolate an image with the precision of ¼ pixel scaled by an offset of 8 bits, respectively. FIGS. 17C, 17D, and 17E illustrate 8-tap filters optimized to interpolate an image with the precision of ¼ pixel scaled by an offset of 8 bits. The 8-tap filters of FIGS. 17C to 17E are classified according to at least one of whether filter coefficients are to be optimized and a method of optimizing filter coefficients. FIGS. 17F and 17G illustrate 8-tap filters optimized to interpolate an image with the precision of ¼ pixel scaled by an offset of 6 bits. The filters of FIGS. 17F and 17G may be classified according to a method of optimizing filter coefficients.

FIG. 17H illustrates a 6-tap filter optimized to interpolate an image with the precision of ⅛ pixel scaled by an offset of 6 bits. FIG. 17I illustrates a 6-tap filter optimized to interpolate an image with the precision of ⅛ pixel scaled by an offset of 8 bits.

FIGS. 17J and 17K illustrate 4-tap filters optimized to interpolate an image with the precision of ⅛ pixel scaled by an offset of 5 bits. The filters of FIGS. 17J and 17K may be classified according to a method of optimizing filter coefficients. FIGS. 17L and 17M illustrate 4-tap filters optimized to interpolate an image with the precision of ⅛ pixel scaled by an offset of 8 bits. The filters of FIGS. 17L and 17M may also be classified according to a method of optimizing filter coefficients.

FIGS. 17N to 17Y illustrate a 4-tap filter, a 6-tap filter, an 8-tap filter, a 10-tap filter, and a 12-tap filter optimized to interpolate an image with the precision of ⅛ pixel scaled by an offset of 8 bits, respectively. The filters of FIGS. 17N to 17Y are different from the filters of FIGS. 17A to 17M in that some of the filter coefficients are different, but are the same as the filters of FIGS. 17A to 17M in that a filter coefficient for interpolating a ⅛ interpolation location is symmetrical with a filter coefficient for interpolating a ⅞ interpolation location, a filter coefficient for interpolating a 2/8 interpolation location is symmetrical with a filter coefficient for interpolating a 6/8 interpolation location, and a filter coefficient for interpolating a ⅜ interpolation location is symmetrical with a filter coefficient for interpolating a ⅝ interpolation location.

FIGS. 23A to 23E illustrate methods of performing scaling and rounding off in relation to a 1D interpolation filter, according to exemplary embodiments.

As described above, interpolation filtering uses DCT and inverse DCT, and the 1D interpolation filter thus includes filter coefficients, the absolute values of which are less than ‘1’. Thus, as described above in relation to Equation (12), the filter coefficients are scaled by multiplying them by ‘2^(offset)’, are rounded off to integers, respectively, and are then used for interpolation.

FIG. 23A illustrates filter coefficients scaled by ‘2 ^(ScalingBits)’ when 1D interpolation filters are 12-tap filters. Referring to FIG. 23A, the filter coefficients have been scaled but are not rounded off to integers. (rewrite . . . okay?)

FIG. 23B illustrates the result of rounding off the scaled filter coefficients of FIG. 23A to integers by rounding them off to the tenth decimal point. Referring to FIG. 23B, some interpolation filters, the sum of rounding off the scaled filter coefficients of which is less than ‘256’ from among the 1D interpolation filters. Specifically, the sum of all the filter coefficients of each of a filter for interpolating pixel values on an ⅛ interpolation location, a filter for interpolating pixel values on a ⅜ interpolation location, a filter for interpolating pixel values on a ⅝ interpolation location, and a filter for interpolating pixel values on a ⅞ interpolation location, is less than ‘256’. That is, the sum of filter coefficients of a filter scaled by an offset of 8 bits should be ‘256’ but an error occurs during rounding off of the filter coefficients.

That the sums of filter coefficients are not the same means that pixel values may vary according to an interpolation location. To solve this problem, a normalized filter may be generated by adjusting filter coefficients. FIG. 23C illustrates a normalized filter generated by the filter coefficients of the filters illustrated in FIG. 23B.

A comparison of FIGS. 23B and 23C reveals that the sums of all the filter coefficients are normalized to ‘256’ by adjusting some of the filter coefficients of the filter for interpolating the pixel values on the ⅛ interpolation location, the filter for interpolating the pixel values on the ⅜ interpolation location, the filter for interpolating the pixel values on the ⅝ interpolation location, and the filter for interpolating pixel values on the ⅞ interpolation location.

FIGS. 23D and 23E illustrate 8-tap filters that are scaled, and the result of normalizing the 8-tap filters, respectively. If the 8-tap filters that are scaled by 2^(offset) are as illustrated in FIG. 23D, then the result of rounding off filter coefficients of the 8-tap filters of FIG. 23D to integer value and normalizing the result of rounding off in such a manner that the sums of the filter coefficients are ‘256’ may be as illustrated in FIG. 23E. Referring to FIG. 23E, some of the filter coefficients are different from the result of rounding off the filter coefficients of the 8-tap filters illustrated in FIG. 23D. This means that some of the filter coefficients are adjusted in such a manner that the sums of all the filter coefficients are ‘256’.

As illustrated in FIGS. 23B and 23C, at least one of resultant filter coefficients obtained by at least one of scaling and rounding off filter coefficients may be different from the result of normalizing the resultant filter coefficients. Thus, it would be obvious to those of ordinary skill in the art that a 1D interpolation filter, at least one from among the filter coefficients of which is changed in a predetermined range of error, e.g., +−1 or +−2, from among the filters illustrated in FIG. 16A to 16F or the filters illustrated in 17A to 17M should be understood to fall within the scope of exemplary embodiments.

If the filter selector 1410 selects one of the filters illustrated in FIGS. 16A to 16F or FIGS. 17A to 17Y or FIGS. 23A to 23E based on an interpolation location, then the interpolator 1420 generates pixel values on the interpolation location by calculating Equation (17) or (18). The other various factors (such as a direction of inter prediction, a type of loop-filter, a position of pixel in a block) may further be considered for the filter selector 1410 to select one of the filters. A size, i.e., a tap size, of a filter that is to be selected may be determined by either the size of a block that is to be interpolated or a direction of filtering for interpolation. For example, a large filter may be selected when a block that is to be interpolated is large, and a small filter may be selected to minimize memory access when interpolation is to be performed in the vertical direction.

According to an exemplary embodiment, information regarding filter selection may be additionally encoded. For example, if an image was interpolated during encoding of the image, a decoding side should know the type of a filter used to interpolate the image so as to interpolate and decode the image by using the same filter used during the encoding of the image. To this end, information specifying the filter used to interpolate the image may be encoded together with the image. However, when filter selection is performed based on the result of previous encoding of another block, that is, context, information regarding filter selection does not need to be additionally encoded.

If a pixel value generated by performing interpolation is less than a minimum pixel value or is greater than a maximum pixel value, then the pixel value is changed to the minimum or maximum pixel value. For example, if the generated pixel value is less than a minimum pixel value of 0, it is changed to ‘0’, and if the generated pixel value is greater than a maximum pixel value of 255, it is changed to ‘255’.

When interpolation is performed to precisely perform inter prediction during encoding of an image, information specifying an interpolation filter may be encoded together with the image. In other words, information regarding the type of the filter selected by the filter selector 1410 may be encoded as an image parameter together with the image. Since a different type of an interpolation filter may be selected in coding units or in slice or picture units, information regarding filter selection may also be encoded in the coding units or the slice or picture units, together with the image. However, if filter selection is performed according to an implicit rule, the information regarding filter selection may not be encoded together with the image.

Methods of performing interpolation by the interpolator 1420 according to exemplary embodiments will now be described in detail with reference to FIGS. 18A, 18B, and 19.

FIGS. 18A and 18B illustrate methods of interpolating pixel values in various directions by using a 1D interpolation filter, according to exemplary embodiments. Referring to FIGS. 18A and 18B, pixel values on interpolation locations in various directions may be generated by using a 1D interpolation filter that may perform 1D DCT on 1D pixel values and perform 1D inverse DCT on the result of performing by using a plurality of basis functions, the phases of which are shifted.

Referring to FIG. 18A, a pixel value P(α) 1800 on an interpolation location α in the vertical direction may be generated by interpolating between a pixel value P₀ 1802 and a pixel value P₁ 1804 that are adjacent in the vertical direction. Compared to the 1D interpolation method of FIG. 13, interpolation is performed using pixel values 1810 and 1820 arranged in the vertical direction instead of the pixel values 1310 and 1320 arranged in the horizontal direction, but the interpolation method described above in relation to Equations (13) to (18) may also be applied to the method of FIG. 18A.

Similarly, compared to the 1D interpolation method of FIG. 13, in the method of FIG. 18B, interpolation is performed using pixel values 1840 and 1850 arranged in a diagonal direction instead of the pixel values 1310 and 1320 arranged in the horizontal direction, but a pixel value P(α) 1830 on an interpolation location α may be generated by interpolating between two adjacent pixel values 1832 and 1834 as described above in relation to Equations (13) to (18).

FIG. 19A illustrates a 2D interpolation method according to an exemplary embodiment. Referring to FIG. 19A, pixel values 1910 to 1950 of fractional pixel units may be generated based on pixel values 1900 to 1906 of integer pixel units.

Specifically, first, the filter selector 1410 of the image interpolation apparatus 1400 illustrated in FIG. 14 selects a 1D interpolation filter to generate pixel values 1910, 1920, 1930, and 1940 of fractional pixel units that are present between the pixel values 1900 to 1906 of integer pixel units. As described above with reference to FIG. 14, a different filter may be selected according to an interpolation location. For example, different filters may be selected for pixel values 1912, 1914, and 1916 of a fractional pixel unit, respectively, so as to interpolate the pixel value 1910 between two upper pixel values 1900 and 1902. For example, a filter for generating the pixel value 1914 of a ½ pixel unit may be different from a filter for generating the pixel values 1912 and 1916 of the same ¼ pixel unit. Also, the pixel values 1912 and 1916 of the same ¼ pixel unit may be generated using different filters, respectively. As described above with reference to FIG. 14, a degree of shifting of the phases of basis functions used to perform inverse DCT varies according to an interpolation location, and thus, a filter for performing interpolation is selected according to an interpolation location.

Similarly, the pixel values 1920, 1930, and 1940 of different fractional pixel units present between the pixel values 1900 to 1906 of integer pixel units may be generated based on a 1D interpolation filter selected according to an interpolation location.

If the filter selector 1410 selects a filter for generating the pixel values 1910, 1920, 1930, and 1940 of fractional pixel units present between the pixel values 1900 to 1906 of integer pixel units, then the interpolator 1420 generates the pixel values 1910, 1920, 1930, and 1940 of fractional pixel units on interpolation locations, respectively, based on the selected filter. According to an exemplary embodiment, since a filter for generating a pixel value on each of interpolation locations has been previously calculated, pixel values on all of the interpolation locations may be generated based on pixel values of integer pixel values.

In other words, since the pixel values 1912 and 1916 of the ¼ pixel unit may be generated directly from the pixel values 1900 and 1920 of an integer pixel unit, there is no need to first calculate the pixel value 1914 of a ½ pixel unit and then generate the pixel values 1912 and 1916 of the ¼ pixel unit based on the pixel values 1900 and 1902 of integer pixel units and the pixel value 1914 of the ½ pixel unit. Since image interpolation does not need to be performed sequentially according to the size of a pixel unit, image interpolation may be performed at high speed.

According to another exemplary embodiment, an interpolation method based on an interpolation location according to an exemplary embodiment may be combined with a related interpolation method. For example, a pixel value of a ½ pixel unit and a pixel value of a ¼ pixel unit may be generated directly from the pixel values 1900 and 1920 of the integer pixel unit by using an interpolation filter according to an exemplary embodiment, and a pixel value of a ⅛ pixel unit may be generated from the pixel value of the ¼ pixel unit by using a related linear interpolation filter. Otherwise, only the pixel value of the ½ pixel unit may be generated directly from the pixel values 1900 and 1920 of the integer pixel unit by using the interpolation filter according to an exemplary embodiment, the pixel value of the ¼ pixel unit may be generated from the pixel value of the ½ pixel unit by using the related art linear interpolation filter, and the pixel value of the ⅛ pixel unit may be generated from the pixel value of the ¼ pixel unit by using the related art linear interpolation filter.

If all of the pixel values 1910, 1920, 1930, and 1940 of the fractional pixel units present between the pixel values 1900 to 1906 of the integer pixel units are generated by performing interpolation, then the filter selector 1410 selects a 1D interpolation filter again for interpolating between the pixel values 1910, 1920, 1930, and 1940 of the fractional pixel units. In this case, a different filter is selected according to an interpolation location similar to a manner in which a filter is selected to interpolate between the pixels values 1900 to 1906 of the integer pixel units.

The interpolator 1420 generates the pixel value 1950 of a fractional pixel unit corresponding to each of interpolation locations by using the filter selected by the filter selector 1410. That is, the pixel value 1950 of the fractional pixel units between the pixel values 1910, 1920, 1930, and 1940 of the fractional pixel units is generated.

FIG. 19B illustrates a 2D interpolation method using a 1D interpolation filter, according to another exemplary embodiment. Referring to FIG. 19B, a pixel value on a 2D interpolation location may be generated by repeatedly performing interpolation in the vertical and horizontal directions using the 1D interpolation filter.

Specifically, a pixel value Temp_((i, j)) is generated by interpolating between a pixel value REF_((i, j)) 1960 and a pixel value REF_((i+1, j)) 1964 of an integer pixel unit in the horizontal direction. Also, a pixel value Temp_((i, j+1)) is generated by interpolating between a pixel value REF_((i, j+1)) 1962 and a pixel value REF_((i+1, j+1)) 1966 in the horizontal direction. Then, a pixel value P_((i, j)) on a 2D interpolation location is generated by interpolating between the pixel value Temp_((i, j)), and the pixel value Temp_((i, j+1)) in the vertical direction.

The 1D interpolation filter may be a filter for performing 1D DCT and performing 1D inverse DCT based on a plurality of basis functions, the phases of which are shifted. Also, the 1D interpolation filter may be a scaled filter as described above in relation to Equation (17). When interpolation is performed in the horizontal and vertical directions based on the scaled filter, interpolation may be performed by calculating the following Equation (21):

$\begin{matrix} {{{Temp}_{({i,j})} = {\left( {{\sum\limits_{1 = {{- M} + 1}}^{M}{{F_{1}^{\prime}\left( \alpha_{x} \right)} \cdot {REF}_{({{i + 1},j})}}} + 2^{{{StageBits}\; 1} - 1}} \right){{StageBits}\; 1}}}\mspace{79mu} {{P_{({i,j})} = {\left( {{\sum\limits_{1 = {{- M} + 1}}^{M}{{F_{1}^{\prime}\left( \text{?} \right)} \cdot {Temp}_{({i,{j + 1}})}}} + \text{?}} \right){{StageBits}\; 2}}},{\text{?}\text{indicates text missing or illegible when filed}}}} & (21) \end{matrix}$

wherein F′_(l)(α_(x)) and F′_(l)(α_(y)) correspond to F′_(l)(α) expressed in Equation (18). However, since a vertical interpolation location may be different from a horizontal interpolation location, a different 1D interpolation filter may be selected according to an interpolation location.

When the horizontal interpolation and the vertical interpolation are performed, first bit shifting is performed according to StageBits 1 after the horizontal interpolation and second bit shifting is performed according to StageBits2 after the vertical interpolation. (TotalBits=StageBits1+StageBits2) If StageBits1 is set to zero, the first bit shifting is not performed.

Thus, if a scaling factor for F′_(l)(a_(y)) is ‘2^(bit1)’ and a scaling factor for F′_(l)(α_(x)) is ‘2^(bit2)’ in Equation (21), then ‘TotalBits=‘bit1’+‘bit2’.

FIG. 19C illustrates a 2D interpolation method using a 1D interpolation filter, according to another exemplary embodiment. Referring to FIG. 19C, a pixel value on a 2D interpolation location may be generated by repeatedly performing interpolation in the vertical and horizontal directions by using the 1D interpolation filter.

Specifically, a pixel value Temp_((i, j)) is generated by interpolating between a pixel values REF_((i, j)) 1960 and a pixel value REF_((i, j+1)) 1962 of an integer pixel unit in the vertical direction. Next, a Temp_((i+1, j)) is generated by interpolating between a pixel value REF_((i, j+1)) 1964 and a pixel value REF_((i+1, j+1)) 1966 in the vertical direction. Then, a pixel value P_((i, j)) on a 2D interpolation location is generated by interpolating between the pixel value Temp_((i, j)) and the pixel value Temp_((i+1, j)). When interpolation is performed in the horizontal and vertical directions based on a scaled filter, interpolation may be performed by calculating the following Equation (22):

$\begin{matrix} {{{Temp}_{({i,j})} = {\left( {{\sum\limits_{1 = {{- M} + 1}}^{M}{{F_{1}^{\prime}\left( \alpha_{y} \right)} \cdot {REF}_{({i,{j + 1}})}}} + 2^{{{StageBits}\; 1} - 1}} \right){{StageBits}\; 1}}}\mspace{79mu} {{P_{({i,j})} = {\left( {{\text{?}{{F_{1}^{\prime}\left( \alpha_{x} \right)} \cdot {Temp}_{({{i + 1},j})}}} + 2^{{{StageBits}\; 2} - 1}} \right){{StageBits}\; 2}}},{\text{?}\text{indicates text missing or illegible when filed}}}} & (22) \end{matrix}$

FIG. 20 is a flowchart illustrating an image interpolation method according to an exemplary embodiment. Referring to FIG. 20, in operation 2010, the image interpolation apparatus 900 of FIG. 9 transforms pixel values in a spatial domain by using a plurality of basis functions having different frequencies. The pixel values may be a plurality of pixel values included in a predetermined block or may be rows or columns of pixel values arranged in the horizontal or vertical direction.

Here, the transform may be 2D DCT or 1D DCT described above in relation to the transformer 910 and Equations (1), (2), (3), and (7).

In operation 2020, the image interpolation apparatus 900 shifts the phases of the plurality of basis functions used in operation 2010. The phases of the plurality of basis functions may be shifted according to a 2D interpolation location determined by ‘α_(x)’ and ‘α_(y)’ or according to a 1D interpolation location determined by ‘α’.

In operation 2030, the image interpolation apparatus 900 inversely transforms DCT coefficients, which were obtained by transforming the pixel values in the spatial domain in operation 2010, by using the plurality of basis functions, the phases of which were shifted in operation 2020. That is, pixel values on interpolation locations are generated by inversely transforming the DCT coefficients obtained in operation 2010.

If the transform performed in operation 2010 is 2D DCT, then in operation 2030, the image interpolation apparatus 900 generates pixel values on 2D interpolation locations by performing 2D inverse DCT on the DCT coefficients by using a plurality of cosine functions, the phases of which are shifted.

If the transform performed in operation 2010 is 1D DCT performed in rows or columns of pixel values, then in operation 2030, the image interpolation apparatus 900 generates pixel values on 1D interpolation locations by performing 1D inverse DCT on the DCT coefficients by using a plurality of cosine functions, the phases of which are shifted.

The plurality of basis functions, the phases of which are shifted and inverse transform based thereon, have been described above in relation to the inverse transformer 920 and Equations (4), (5), (6), and (8).

FIG. 21 is a flowchart illustrating an image interpolation method according to another exemplary embodiment. Referring to FIG. 21, in operation 2110, the image interpolation apparatus 1400 of FIG. 14 selects a filter for performing transform and performing inverse transform based on a plurality of basis functions, the phases of which are shifted, according to an interpolation location. For example, a filter for performing DCT and performing inverse DCT based on a plurality of cosine functions, the phases of which are shifted, is selected according to an interpolation location. If pixel values that are to be interpolated are included in a predetermined block, then a filter for performing 2D DCT and 2D inverse DCT is selected based on ‘α_(x)’ and ‘α_(y)’. If pixel values that are to be interpolated are rows or columns of pixel values, then a filter for performing 1D DCT and 1D inverse DCT is selected based on ‘α’. One of the filters described above with reference to FIG. 15, FIGS. 16A to 16F, and FIG. 17 may be selected according to an interpolation location. However, the size of a filter may be determined by the various other factors apart from an interpolation location as described above in relation to the filter selector 1410 and with reference to FIG. 17.

In operation 2120, the image interpolation apparatus 1400 performs interpolation based on the filter selected in operation 2110. Pixel values on a 2D interpolation location or a pixel value on a 1D interpolation location may be generated by filtering pixel values in a spatial domain by using the filter selected in operation 2110. Interpolation performed using filtering has been described above in relation to Equations (9) to (19).

FIG. 22 is a flowchart illustrating an image interpolation method according to another exemplary embodiment. Referring to FIG. 22, in operation 2210, the image interpolation apparatus 1400 of FIG. 14 selects a different filter for interpolating between pixel values 1900 to 1906 of integer pixel units, according to an interpolation location. In the current exemplary embodiment, pixel values 1910, 1920, 1930, and 1940 of at least one fractional pixel unit may be generated directly from the pixel values 1900 to 1906 of the integer pixel values. Thus, the image interpolation apparatus 1400 selects interpolation filters corresponding to the interpolation locations, respectively, in operation 2210.

In operation 2220, the image interpolation apparatus 1400 generates the pixel values 1910, 1920, 1930, and 1940 of the at least one fractional pixel unit by interpolating between the pixel values 1900 to 1906 of the integer pixel units, based on the different filter selected according to each of interpolation locations in operation 2210.

In operation 2230, the image interpolation apparatus 1400 selects a different filter for interpolating between the pixel values 1910, 1920, 1930, and 1940 of the at least one fractional pixel unit generated in operation 2220, according to an interpolation location. A different filter for generating the pixel values 1950 of another fractional pixel unit illustrated in FIG. 19, which are present between the pixel values 1910, 1920, 1930, and 1940 of the at least one fractional pixel unit, is selected according to an interpolation location.

In operation 2240, the image interpolation apparatus 1400 generates the pixel values 1950 of another fractional pixel unit by interpolating the pixel values 1910, 1920, 1930, and 1940 of the at least one fractional pixel unit, based on the filter selected in operation 2230.

While exemplary embodiments have been particularly shown and described above, it will be understood by one of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the inventive concept as defined by the following claims and their equivalents. Also, a system according to an exemplary embodiment can be embodied as computer readable code on a computer readable recording medium.

For example, each of an apparatus for encoding an image, an apparatus for decoding an image, an image encoder, and an image decoder according to exemplary embodiments as illustrated in FIGS. 1, 2, 4, 5, 9, and 14, may include a bus coupled to units thereof, at least one processor connected to the bus, and memory that is connected to the bus to store a command or a received or generated message and is coupled to the at least one processor to execute the command.

The computer readable recording medium may be any data storage device that can store data to be read by a computer system. Examples of the computer readable recording medium include read-only memory (ROM), random-access memory (RAM), compact disc (CD)-ROM, magnetic tapes, floppy disks, and optical data storage devices. The computer readable recording medium can also be distributed over network-coupled computer systems so that the computer readable code may be stored and executed in a distributed fashion. 

What is claimed is:
 1. A method of motion compensation, the method comprising: determining, in a luma reference picture, a luma reference block for prediction of a current block by using a luma motion vector; generating a luma sample of a 2/4-pixel location included in the luma reference block, by applying an 8-tap interpolation filter to luma samples of an integer pixel location of the luma reference picture; and generating a luma sample of a ¼-pixel location or a ¾-pixel location included in the luma reference block, by applying an interpolation filter to the luma samples of the integer pixel location of the luma reference picture without using the generated luma sample of the 2/4-pixel location, wherein the 8-tap interpolation filter includes eight filter coefficients, and wherein filter coefficients of an interpolation filter for generating the luma sample of the ¼-pixel location are arranged in reverse order against filter coefficients of an interpolation filter for generating the luma sample of the ¾-pixel location.
 2. The method of claim 1, wherein the generating of the luma sample of a 2/4-pixel location comprises scaling the luma sample generated by applying the 8-tap interpolation filter by using a luma scaling factor that a sum of coefficients of the 8-tap interpolation filter is 1, wherein the luma scaling factor is
 64. 3. The method of claim 1, wherein: an image is split into a plurality of maximum coding units, a maximum coding unit, among the plurality of maximum coding units, is hierarchically split into one or more coding units of depths including at least one of a current depth and a lower depth according to split information indicating whether a coding unit is split, when the split information indicates a split for the current depth, a coding unit of the current depth is split into four coding units of the lower depth, independently from neighboring coding units, and when the split information indicates a non-split for the current depth, the prediction units are obtained from the coding unit of the current depth. 